Register Allocation for Unary-Binary Trees
نویسندگان
چکیده
We study the number of registers required for evaluating arithmetic expressions formed with any set of unary and binary operators. Our approach consists in a singularity analysis of intervening generating functions combined with a use of (complex) Mellin inversion. We illustrate it first by rederiving the known results about binary trees and then extend it to the fully general case of unaj-binary trees. The method used, as mentioned in the conclusion, is applicable to a wide class of combinatorial sums.
منابع مشابه
Monotonically labelled Motzkin trees
Consider a rooted tree structure the nodes of which have been labelled monotonically by elements of { 1, 2, . . .,k}, which means that any sequence connecting the root of the tree with a leaf is weakly monotone . For fixed k asymptotic equivalents of the form CA gA °n; 2 (n --oo) to the numbers of such tree structures with n nodes are obtained for the family of extended unary-binary trees (i .e...
متن کاملEfficient random sampling of binary and unary-binary trees via holonomic equations
We present a new uniform random sampler for binary trees with n internal nodes consuming 2n + Θ(log(n)) random bits on average. This makes it quasi-optimal and out-performs the classical Remy algorithm. We also present a sampler for unary-binary trees with n nodes taking Θ(n) random bits on average. Both are the first linear-time algorithms to be optimal up to a constant.
متن کاملA semantic construction of two-ary integers
To binary trees, two-ary integers are what usual integers are to natural numbers, seen as unary trees. We can represent two-ary integers as binary trees too, yet with leaves labelled by binary words and with a structural restriction. In a sense, they are simpler than the binary trees, they relativize. Hence, contrary to the extensions known from Arithmetic and Algebra, this integer extension do...
متن کاملMSO Querying over Trees via Datalog Evaluation
The MSO evaluation problem on trees is the problem of computing, for any MSO formula φ and any finite tree T , the set of satisfying assignments of φ(X1, . . . ,Xk) over T . In [3] we considered the MSO evaluation problem on full binary trees as a Datalog query evaluation problem, and gave a Datalog-theoretic solution to it for any MSO formula φ; we thus subsumed previous results obtained for a...
متن کاملOptimal Dual-Issue Instruction Scheduling With Spills For Binary Expression Trees
We describe an algorithm that produces code, with spills, for a register-constrained machine that can issue up to one arithmetic operation and one memory access operation per time slot, under the restrictions that the code's dependence graph is represented as a binary tree with no unary operations, and the latency of the operations is 1. We prove that the algorithm produces a minimum cost sched...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 15 شماره
صفحات -
تاریخ انتشار 1986